Sorting can exponentially speed up pure dynamic programming
نویسندگان
چکیده
منابع مشابه
Greedy can also beat pure dynamic programming
Many dynamic programming algorithms are “pure” in that they only use min or max and addition operations in their recursion equations. The well known greedy algorithm of Kruskal solves the minimum weight spanning tree problem on n-vertex graphs using only O(n logn) operations. We prove that any pure DP algorithm for this problem must perform 2 operations. Since the greedy algorithm can also badl...
متن کاملDynamic environments can speed up evolution with Genetic Programming Technical Report UCD-CSI-2011-03
We present a study of dynamic environments with genetic programming to ascertain if a dynamic environment can speed up evolution when compared to an equivalent static environment. We present an analysis of the types of dynamic variation which can occur with a variable-length representation such as adopted in genetic programming identifying modular varying, structural varying and incremental var...
متن کاملExtending the Quadrangle Inequality to Speed-Up Dynamic Programming
Proving that a function satisfies the quadrangle inequality is a powerful and elegant way to show that a dynamic programming algorithm to compute that function can be sped up by a factor of the input size. In this paper we consider two problems that do no fit in the usual general cases of functions that satisfy the quadrangle inequality but for which the proof of the quadrangle inequality still...
متن کاملSpeeding up Dynamic Programming
A number of important computational problems in molecular biology, geology, speech recognition, and other areas, can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, we speed up the computation of several of these recurrences by one or two orders...
متن کاملElements of Dynamic Programming in Sorting
Dynamic programming is an effective algorithm design method. Sorting is believed to be an unusual area for dynamic programming. Our finding is contrary to this conventional belief. Though it appears that classical sorting algorithms were designed using bottom up design approach, but we have found the evidence which suggests that some classical sorting algorithms can also be designed using Dynam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2020
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2020.105962